Applications of generalized convolutions associated with the Fourier and Hartley transforms
نویسندگان
چکیده
منابع مشابه
Applications of Generalized Convolutions Associated with the Fourier and Hartley Transforms
In this paper we present new generalized convolutions with weight-function associated with the Fourier and Hartley transforms, and consider applications. Namely, using the generalized convolutions, we construct normed rings on the space L(R), provide the sufficient and necessary condition for the solvability of a class of integral equations of convolution type, and receive the explicit solution...
متن کاملDiscrete Fractional Hartley and Fourier Transforms
This paper is concerned with the definitions of the discrete fractional Hartley transform (DFRHT) and the discrete fractional Fourier transform (DFRFT). First, the eigenvalues and eigenvectors of the discrete Fourier and Hartley transform matrices are investigated. Then, the results of the eigendecompositions of the transform matrices are used to define DFRHT and DFRFT. Also, an important relat...
متن کاملGeneralized Fourier Transforms and their Applications
This thesis centers around a generalization of the classical discrete Fourier transform. We first present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group or semisimple algebra. By extending work which connects Bratteli diagrams to the construction of Fast Fourier Transform algorithms [2], we make exp...
متن کاملComputation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms
Discrete transforms are introduced and are defined in a ring of polynomials. These polynomial transforms are shown to have the convolution property and can be computed in ordinary arithmetic, without multiplications. Polynomial transforms are particularly well suited for computing discrete two-dimensional convolutions with a minimum number of operations. Efficient algorithms for computing one-d...
متن کاملSparse Generalized Fourier Transforms ∗
Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Integral Equations and Applications
سال: 2012
ISSN: 0897-3962
DOI: 10.1216/jie-2012-24-1-111